- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by C. R. J. Clapham
9 found
Order:
- Collins Donald J.. Recursively enumerable degrees and the conjugacy problem. Acta mathematica, vol. 122 , pp. 115–160.C. R. J. Clapham - 1971 - Journal of Symbolic Logic 36 (3):540.
- William W. Boone, Frank B. Cannonito, and Roger C. Lyndon. Introduction. Word problems, Decision problems and the Burnside problem in group theory, edited by W. W. Boone, F. B. Cannonito, and R. C. Lyndon, Studies in logic and the foundations of mathematics, vol. 71, North-Holland Publishing Company, Amsterdam and London1973, pp. ix–xii. [REVIEW]C. R. J. Clapham - 1976 - Journal of Symbolic Logic 41 (4):785-788.
- Donald J. Collins. On recognising properties of groups which have solvable word problem. Archiv der Mathematik, vol. 21 , pp. 31–39. [REVIEW]C. R. J. Clapham - 1974 - Journal of Symbolic Logic 39 (2):340.
- Grindlingér É. I.. O nérazréšimosti problémy toždéstva slov dlá odnogo klassa polugrupp s razréšimoj problèmoj izomorfizma. Doklady Akadémii Nauk SSSR, vol. 171 , pp. 519–520.Grindlinger [Greendlinger] E. I.. On the unsolvability of the word problem for a class of semigroups with a solvable isomorphism problem. English translation of the preceding by Greendlinger M.. Soviet mathematics, vol. 7 no. 6 , pp. 1502–1503. [REVIEW]C. R. J. Clapham - 1968 - Journal of Symbolic Logic 33 (3):469-469.
- Review: Donald J. Collins, On Recognizing Properties of Groups which have Solvable Word Problem. [REVIEW]C. R. J. Clapham - 1974 - Journal of Symbolic Logic 39 (2):340-340.
- Review: Donald J. Collins, Recursively Enumerable Degrees and the Conjugacy Problem. [REVIEW]C. R. J. Clapham - 1971 - Journal of Symbolic Logic 36 (3):540-540.
- Review: E. I. Grindlinger, On the Unsolvability of the Word Problem for a Class of Semigroups with a Solvable Isomorphism Problem; M. Greendlinger, Soviet Mathematics. [REVIEW]C. R. J. Clapham - 1968 - Journal of Symbolic Logic 33 (3):469-469.
- Review: William W. Boone, Frank B. Cannonito, Roger C. Lyndon, Word Problems, Decision Problems and Burnside Problem in Group Theory. [REVIEW]C. R. J. Clapham - 1976 - Journal of Symbolic Logic 41 (4):785-788.
- Trevor Evans. The word problem for abstract algebras. The journal of the London Mathematical Society, vol. 26 , pp. 64–71. - Trevor Evans. Embeddability and the word problem. The journal of the London Mathematical Society, vol. 28 , pp. 76–80. [REVIEW]C. R. J. Clapham - 1969 - Journal of Symbolic Logic 34 (3):507.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-5ff6c685cb-rv6xt uwo